package 剑指offer;

public class 数字在升序数组出现的次数 {
    public int GetNumberOfk(int[] array, int k){
        int count = 0;
        for (int i = 0; i < array.length; i++) {
             if (array[i]==k){
                 count++;
             }
        }
        return count;
    }

}
